A parametric linearizing approach for quadratically inequality constrained quadratic programs
نویسندگان
چکیده
منابع مشابه
A Binarisation Approach to Non-Convex Quadratically Constrained Quadratic Programs
The global optimisation of non-convex quadratically constrained quadratic programs is a notoriously difficult problem, being not only NP-hard in the strong sense, but also very difficult in practice. We present a new heuristic approach to this problem, which enables one to obtain solutions of good quality in reasonable computing times. The heuristic consists of four phases: binarisation, convex...
متن کاملReformulating Mixed-Integer Quadratically Constrained Quadratic Programs
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solut...
متن کاملConvex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Nonconvex quadratic constraints can be linearized to obtain relaxations in a wellunderstood manner. We propose to tighten the relaxation by using second order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds. The second order cone constraints are based on linear combinations of pairs of vari...
متن کاملRepresenting quadratically constrained quadratic programs as generalized copositive programs
We show that any nonconvex quadratically constrained quadratic program (QCQP) can be represented as a generalized copositive program. In fact, we provide two representations. The first is based on the concept of completely positive (CP) matrices over second order cones, while the second is based on CP matrices over the positive semidefinte cone. Our analysis assumes that the feasible region of ...
متن کاملFaster, but weaker, relaxations for quadratically constrained quadratic programs
We introduce a new relaxation framework for nonconvex quadratically constrained quadratic programs (QCQPs). In contrast to existing relaxations based on semidefinite programming (SDP), our relaxations incorporate features of both SDP and second order cone programming (SOCP) and, as a result, solve more quickly than SDP. A downside is that the calculated bounds are weaker than those gotten by SD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2018
ISSN: 2391-5455
DOI: 10.1515/math-2018-0037